منابع مشابه
Generalized Analytic Functions on Generalized Domains
We define the algebra G̃(A) of Colombeau generalized functions on a subset A of the space of generalized points R̃d. If A is an open subset of R̃d, such generalized functions can be identified with pointwise maps from A into the ring of generalized numbers C̃. We study analyticity in G̃(A), where A is an open subset of C̃. In particular, if the domain is an open ball for the sharp norm on C̃, we chara...
متن کاملOn maximal QROBDD's of Boolean functions
We investigate the structure of “worst-case” quasi reduced ordered decision diagrams and Boolean functions whose truth tables are associated to: we suggest different ways to count and enumerate them. We, then, introduce a notion of complexity which leads to the concept of “hard” Boolean functions as functions whose QROBDD are “worstcase” ones. So we exhibit the relation between hard functions a...
متن کاملOn Maximal Functions for Mikhlin-hörmander Multipliers
Given Mikhlin-Hörmander multipliers mi, i = 1, . . . , N , with uniform estimates we prove an optimal p log(N + 1) bound in L for the maximal function supi |F[mi b f ]| and related bounds for maximal functions generated by dilations. These improve results in [7].
متن کاملSpherical Maximal Operators on Radial Functions
where dσ is the rotationally invariant measure on Sd−1, normalized such that σ(Sd−1) = 1. Stein [5] showed that limt→0Atf(x) = f(x) almost everywhere, provided f ∈ L(R), p > d/(d − 1) and d ≥ 3. Later Bourgain [1] extended this result to the case d = 2. If p ≤ d/(d − 1) then pointwise convergence fails. However if {tj}j=1 is a fixed sequence converging to 0 then pointwise convergence may hold f...
متن کاملOn limitwise monotonicity and maximal block functions
We prove the existence of a limitwise monotonic function g : N→ N \ {0} such that, for any Π1 function f : N → N \ {0}, Ran f 6= Ran g. Relativising this result we deduce the existence of an η-like computable linear ordering A such that, for any Π2 function F : Q → N \ {0}, and η-like B of order type ∑ {F (q) | q ∈ Q }, B A . We prove directly that, for any computable A which is either (i) stro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1993
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1993-1158009-5